Axial Constraints for Global Matching-based Optical Flow Estimation

نویسندگان

چکیده

Optical flow estimation is a fundamental task that aims to find the 2-dimensional motion field by identifying correspondences between two input images. For quite long time, correlation volume followed convolutional neural networks (CNN) directly estimates optical was predominant pipeline. However, several pioneering methods proposed global matching recently, pointing out limitation CNN-based are struggling handle large displacements due their locality. Global step identifies at pixel-level using entire volumes once with simple operations like softmax. when softmax combined commonly used regression loss in estimation, there will be vast number of possible can minimize and correctly estimate correspondences. In other words, training objective induces one-to-many solution problem resulting presence noisy gradients. this paper, necessity for more constraints on mitigate aforementioned ill-posed discussed. To acquire such constraints, axial cross-entropy (i.e. constraints) restrict have low variance designed pseudo ground truth proposed. Experimental results show axial-constraints applicable off-the-shelves matching-based frameworks easily lead both quantitative qualitative performance improvement without any architectural changes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pyramidal Gradient Matching for Optical Flow Estimation

Initializing optical flow field by either sparse descriptor matching or dense patch matches has been proved to be particularly useful for capturing large displacements. In this paper, we present a pyramidal gradient matching approach that can provide dense matches for highly accurate and efficient optical flow estimation. A novel contribution of our method is that image gradient is used to desc...

متن کامل

Multiple Combined Constraints for Optical Flow Estimation

Several approaches to optical flow estimation use differential methods to model changes in image brightness over time. In computer vision it is often desirable to over constrain the problem to more precisely determine the solution and enforce robustness. In this paper, two new solutions for optical flow computation are proposed which are based on combining brightness and gradient constraints us...

متن کامل

A method of performance estimation for axial-flow turbines based on losses prediction

The main objective in this paper is creating a method for one-dimensional modeling of multi stage axial flow turbine. The calculation used in this technique is based on common thermodynamics and aerodynamics principles in a mean stream line analyses. In this approach, loss models have to be used to determine the entropy increase across each section in the turbine stage. Finally, the analysis an...

متن کامل

Temporal Constraints in Large Optical Flow Estimation

The aim of this work is to propose a model for computing the optical flow in a sequence of images. We introduce a new temporal regularizer that is suitable for large displacements. We propose to decouple the spatial and temporal regularizations to avoid an incongruous formulation. For the spatial regularization we use the Nagel–Enkelmann operator and a newly designed temporal regularization. Ou...

متن کامل

Combinatorial Regularization of Descriptor Matching for Optical Flow Estimation

One fundamental step in many state of the art optical flow methods is the initial estimation of reliable correspondences. It is well-established to extract and match features such as HOG to handle large displacements. We propose a combinatorial refinement of the initial matching. Optimization is done in the space of affine motion, where we regularize between neighboring points and similar regio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3290993